Optimization complexity of linear logic proof games
نویسندگان
چکیده
منابع مشابه
Optimization Complexity of Linear Logic Proof Games
A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the np-complete multiplicative fragment (mll) extended with additive constants and the pspace-complete multiplicative, additive fragment (mall) of propositional linear logic. In each cas...
متن کاملSymmetric dialogue games in the proof theory of linear logic
Symmetric dialogue games in the proof theory of linear logic Présentée et soutenue publiquement par Olivier Delande le 15 octobre 2009 devant le jury composé de Claudia Faggian André Hirschowitz Rapporteur Olivier Laurent Paul-AndréMellì es Dale Miller Directeur de thèse Laurent Regnier Rapporteur ii Acknowledgements My first and foremost thanks go to my adviser Dale Miller for his support over...
متن کاملThe Complexity of Local Proof Search in Linear Logic
Proof search in linear logic is known to be diicult: the provability of propositional linear logic formulas is undecidable. Even without the modalities, multiplicative-additive fragment of propositional linear logic, mall, is known to be pspace-complete, and the pure multiplicative fragment, mll, is known to be np-complete. However, this still leaves open the possibility that there might be pro...
متن کاملLogic, Complexity, and Games
In this talk, I will discuss an approach to the P = NP question via the correspondence between logic and complexity. The main focus will be on the possible use of Ehrenfeucht-Fraı̈ssé games.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00057-2